DIMENSION AND INTERVAL DIMENSION OF CERTAIN BIPARTITE ORDERED SETS
نویسندگان
چکیده
منابع مشابه
The Dimension of the Convolution of Bipartite Ordered Sets
In this paper, for any two bipartite ordered sets P and Q; we de ne the convolution P Q of P and Q: For dim(P ) = s and dim(Q) = t; we prove that s+ t (U + V ) 2 dim(P Q) s+t (U+V )+2; where U+V is the max-min integer of the certain realizers. In particular, we also prove that dim(Pn;k) = n+k b n+k 3 c for 2 k n < 2k and dim(Pn;k) = n for n 2k; where Pn;k = Sn Sk is the convolution of two stand...
متن کاملdedekind modules and dimension of modules
در این پایان نامه، در ابتدا برای مدول ها روی دامنه های پروفر شرایط معادل به دست آورده ایم و خواصی از ددکیند مدول ها روی دامنه های پروفر مشخص کرده ایم. در ادامه برای ددکیند مدول های با تولید متناهی روی حلقه های به طور صحیح بسته شرایط معادل به دست آورده ایم و ددکیند مدول های ضربی را مشخص کرده ایم. گزاره هایی در مورد بعد ددکیند مدول ها بیان کرده ایم. در پایان، قضایای lying over و going down را برا...
15 صفحه اولThe Dimension of Random Ordered Sets
Let P = (X, <) be a finite ordered set and let I PI denote the cardinality of the universe X. Also let A(P) denote the maximum degree of P, i.e., the maximum number of points comparable to any one point of P. Fiiredi and Kahn used probabilistic methods to show that the dimension of P satisfies dim(P) I c,A(P) log(P1 and dim(P) 5 c,A(P) log2A(P) where c , and c, are positive absolute constants. ...
متن کاملMaximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension
Dushnik and Mikr detirw tht: dimension of a partially crderc-d set X, denoted dim X, as the smallest positive integLi f for whkh thckre exist t linear estcnsions of X whose inter-saztion is the partial ordertng OF A'. Hiraguchi proved that ifr-t 2 2 and 1x1 G 2rt + 1, then dim X Q. n. dogart, Trotter and Kim& have gsven a forbidden c-• bposet characteriza?ion of Htraguchi " s Inequality by dete...
متن کاملComputational aspects of the 2-dimension of partially ordered sets
A well-known method to represent a partially ordered set P (order for short) consists in associating to each element of P a subset of a 7xed set S = {1; : : : ; k} such that the order relation coincides with subset inclusion. Such an embedding of P into 2 (the lattice of all subsets of S) is called a bit-vector encoding of P. These encodings provide an interesting way to store an order. They ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2009
ISSN: 1015-8634
DOI: 10.4134/bkms.2009.46.1.079